Transcendental syntax II: non deterministic case
نویسنده
چکیده
Using a non deterministic analytics, it is possible to expand the autonomous explanation of logic, a.k.a. transcendental syntax, to full logic, i.e., first order predicate calculus with equality. This paper concentrates on additives, intuitionistic negation and on a paradoxically unexplored territory: predicates (by opposition to propositions).
منابع مشابه
Geometry of Interaction VI: a blueprint for Transcendental Syntax
The paper makes use of a finitary version of Geometry of Interaction to fix most pending problems in propositional proof-nets. The methodological guidelines are those of transcendental syntax. 1 Transcendental Syntax Transcendental syntax starts where semantics fails: foundational issues1. 1.1 Splendor. . . Semantics is very valuable tool: nothing is better than a good model-theoretic argument....
متن کاملTranscendental syntax I: deterministic case
We study logic in the light of the Kantian distinction between analytic (untyped, meaningless, locative) answers and synthetic (typed, meaningful, spiritual) questions. Which is specially relevant to proof-theory: in a proof-net, the upper part is locative, whereas the lower part is spititual: a posteriori (explicit) as far as correctness is concerned, a priori (implicit) for questions dealing ...
متن کاملTranscendental syntax 2.0
How come that finite language can produce certainty — at least a sufficiently certain certainty, sometimes apodictic — in the presence of infinity? The answer can by no means be found in external reality, quite the contrary: it seems that the very purpose of semantics is to make this question untractable with the help of an ad hoc analytical newspeak in which one cannot even formulate the above...
متن کامل-calculus Its Syntax and Basic Properties
calculus is a new calculus that integrates in a uniform and simple settings rst-order rewriting,-calculus and non-deterministic computations. This paper describes the calculus from its syntax to its basic properties in the untyped case. We show how it embeds rst-order rewriting and-calculus. Finally we shows how-calculus can be used to give an operational semantics to the rewrite based language...
متن کاملOBDD-based Universal Planning: Specifying and Solving Planning Problems for Synchronized Agents in Non-deterministic Domains
Recently model checking representation and search techniques were shown to be eeciently applicable to planning, in particular to non-deterministic planning. Such planning approaches use Ordered Binary Decision Diagrams (obdds) to encode a planning domain as a non-deterministic nite automaton (NFA) and then apply fast algorithms from model checking to search for a solution. obdds can eeectively ...
متن کامل